Divide and conquer: resonance induced by competitive interactions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divide and conquer: resonance induced by competitive interactions

We study an Ising model in a network with disorder induced by the presence of both attractive and repulsive links and subjected to a periodic subthreshold signal. By means of numerical simulations and analytical calculations we give evidence that the global response of the system reaches a maximum value for a given fraction of the number of repulsive interactions. The model can represent a netw...

متن کامل

Divide and conquer: resonance induced by competitive interactions

We study an Ising model in a network with disorder induced by the presence of both attractive and repulsive links. This system is subjected to a subthreshold signal, and the goal is to see how the response is enhanced for a given fraction of repulsive links. This can model a network of spin-like neurons with excitatory and inhibitory couplings. By means of numerical simulations and analytical c...

متن کامل

Divide and Conquer

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

متن کامل

Plan Mining by Divide-and-Conquer

Plans or sequences of actions are an important form of data With the proliferation of database technology plan databases or planbases are increasingly common E cient discovery of important patterns of actions in plan databases presents a challenge to data mining In this paper we present a method for mining signi cant patterns of successful actions in a large planbase using a divide and conquer ...

متن کامل

Divide and (Iteratively) Conquer!

The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The European Physical Journal B

سال: 2008

ISSN: 1434-6028,1434-6036

DOI: 10.1140/epjb/e2008-00437-9